TRB exam online practice test for Computer Science and Engineering dept provides you with ample practice material for TRB exam preparation for cse department which adheres to the real exam format. Each TRB - CSE exam practice test has 10 questions. After completing click on to the COMPLETE TEST to know the score and the correct answers.


Computer Science and Engineering - TRB Online Practice Test - 7

  • Online Practice Test - CSE
   

1.
  What is the minimum number of nodes in a complete binary tree of height K?.
  • A.   2k-1
  •  
  • B.   2k-1+1
  •  
  • C.   2k-1
  •  
  • D.   2k
  Options: A    B    C    D   
   
 
   

2.
  Consider a weighted complete graph G on the vertex set {V1 , V2,………Vn} such that the weight of edge (Vi , Vj) is 2|i-j|. The weight of minimum spanning tree of G is :.
  • A.   2n-2
  •  
  • B.   n-1
  •  
  • C.   n/2
  •  
  • D.   n2
  Options: A    B    C    D   
   
   

3.
  A grammar that produces more than one leftmost or more than one right most derivation for the same sentence is called:.
  • A.   LL(1) grammar
  •  
  • B.   Operator grammar
  •  
  • C.   Ambiguous grammar
  •  
  • D.   LR grammar
  Options: A    B    C    D   
   
 
   

4.
  A technique where DMA controller is given complete access to main memory:.
  • A.   Cache coherence
  •  
  • B.   Victim cache
  •  
  • C.   Simple cache
  •  
  • D.   Cache protocol
  Options: A    B    C    D   
   
   

5.
  In case of zero address instruction the operands are stored in :.
  • A.   Registers
  •  
  • B.   Accumulators
  •  
  • C.   Push down stack
  •  
  • D.   Cache
  Options: A    B    C    D   
   
 
   

6.
  Logic X-OR operation of (4ACO)H and (B53F)H results :.
  • A.   1111
  •  
  • B.   OFFF
  •  
  • C.   FFFO
  •  
  • D.   FFFF
  Options: A    B    C    D   
   
   

7.
  Which is the fastest storage unit in a usual memory hierarchy?.
  • A.   Cache
  •  
  • B.   Main memory
  •  
  • C.   Hard disk memory
  •  
  • D.   Register
  Options: A    B    C    D   
   
 
   

8.
  Red Black tree is a coloured :.
  • A.   B tree
  •  
  • B.   AVL tree
  •  
  • C.   Binary tree
  •  
  • D.   Binary search tree
  Options: A    B    C    D   
   
   

9.
  The scope of an external variable is :.
  • A.   Whole source file in which it is defined
  •  
  • B.   From the point of declaration to the end of the file in which it is defined
  •  
  • C.   Any source file in a program
  •  
  • D.   From the point of declaration to the end of the file being compiled
  Options: A    B    C    D   
   
 
   

10.
  IP addresses are written in -----------.
  • A.   Integer notation
  •  
  • B.   Floating point notation
  •  
  • C.   Summing notation
  •  
  • D.   Dotted decimal notation
  Options: A    B    C    D   
   

Complete Test
tnscholars.com

 

 

 

tnscholars.com.